Rascal Tooling for Datatype Defining Rewrite Systems

نویسنده

  • W. K. van Woerkom
چکیده

It has been argued in [7] that using automated provers such as AProVE [4] and CSI [3] can benefit research projects on the topic of datatype defining rewrite systems (DDRSs), as the size of these DDRSs make manual completeness proofs long and error-prone. The authors of [7] note that no similar software exists for the ground-confluence property, and in [1] it is argued that such software should be developed. The present work details an implementation of such a prover, developed in Rascal [2], which operates according to the ground-confluence proof methodology used in [1]. Alongside this prover other Rascal tools are detailed that serve practical purposes related to the use of provers. The proof methodology is first shown to be correct, and the tools are then detailed through code fragments and demonstrations of their workings. It is argued that these tools may accelerate DDRS research and help prevent errors. A demonstration of the ground-confluence prover reveals an oversight made in previous research, thus further confirming the need for such tools.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Three Datatype Defining Rewrite Systems for Datatypes of Integers each extending a Datatype of Naturals

Integer arithmetic is specified according to three views: unary, binary, and decimal notation. The binary and decimal view have as their characteristic that each normal form resembles common number notation, that is, either a digit, or a string of digits without leading zero, or the negated versions of the latter. The unary view comprises a specification of integer arithmetic based on 0, succes...

متن کامل

Towards a Datatype Defining Rewrite System for Rational Arithmetic

In [3] the concept of datatype defining rewrite systems (DDRSs) is introduced. A DDRS is an equational specification of a datatype that yields a ground-complete term rewriting system (TRS) when its equations are interpreted from left to right as rewrite rules. In [3] a number of DDRSs are presented for terms in unary, binary, and decimal notation. The goal of the present work is to review wheth...

متن کامل

The Kansas University rewrite engine - A Haskell-Embedded Strategic Programming Language with Custom Closed Universes

When writing transformation systems, a significant amount of engineering effort goes into setting up the infrastructure needed to direct individual transformations to specific targets in the data being transformed. Strategic programming languages provide general-purpose infrastructure for this task, which the author of a transformation system can use for any algebraic data structure. The Kansas...

متن کامل

RLSRunner: Linking Rascal with K for Program Analysis

The Rascal meta-programming language provides a number of features supporting the development of program analysis tools. However, sometimes the analysis to be developed is already implemented by another system. In this case, Rascal can provide a useful front-end for this system, handling the parsing of the input program, any transformation (if needed) of this program into individual analysis ta...

متن کامل

The Formal Semantics of Rascal Light

Rascal [4] is a programming language that aims to simplify software language engineering tasks like defining syntax, analyzing and transforming programs, and generating code. The language provides many high-level features including native support for collections (lists, sets, maps), algebraic data-types, powerful pattern matching operations with backtracking, and high-level traversals supportin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017